Bi-elastic Neighbourhood Models
نویسنده
چکیده
We extend Buja’s concept of “pseudo-capacities”, which comprises the neighbourhood models for classical probabilities commonly used in robust statistics. Although systematically developing various directions for generalizing that model, we especially show that robust statistics can be freed from the severe restriction to 2-monotone capacities by employing the more natural framework of coherent or F-probabilities. Our main new tool for doing this is to use bi-elastic instead of convex functions.
منابع مشابه
Generalized Conditioning in Neighbourhood Models
Sets of probability measures which form neighbourhoods of classical probability measures are studied. An application of Jeffrey’s rule of conditioning to forming neighbourhoods of probability measures is proposed. Neighbourhoods that are closed for generalized conditioning according to this rule are characterized. They are shown to be exactly convex and bi-elastic neighbourhoods.
متن کاملDesign of a Bi-Objective Capacitated Single-Allocation Incomplete Hub Network Considering an Elastic Demand
This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location...
متن کاملModeling re ections with an elastic screen method
This paper gives two versions of elastic screen method The wide angle version has a better accuracy while the small angle approximation is more e cient The accu racy of the re ectivity is discussed by comparing the analytical results from the screen method and those directly from plane wave re ections The accuracy of waveform is checked by comparing synthetic seis mograms from both screen metho...
متن کاملThe Neighbourhood Polynomial of some Nanostructures
The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...
متن کاملA Bi-level Formulation for Centralized Resource Allocation DEA Models
In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...
متن کامل